Feature Space Transformation using Equation Discovery
نویسندگان
چکیده
In Machine Learning, the success and performance of learning often critically depends on the feature space provided. For instance, when learning a classifier f1, . . . , fn → c that maps features f1, . . . , fn to classes c, appropriate encodings of f1, . . . , fn are often as important as the choice of learning algorithm itself. This is particularly true for robot learning, where feature spaces are typically high dimensional and features are continuous. Consider an example from a robotic navigation, depicted in Figure 1. In [1], the robot learns to predict navigation execution duration given the current and goal pose, from observed experience. By exploiting translational and rotational invariances, the original 6-dimensional state space can be reduced to 3 dimensions. The benefit is that fewer examples are needed to learn an accurate prediction model.
منابع مشابه
A Note on Solving Prandtl's Integro-Differential Equation
A simple method for solving Prandtl's integro-differential equation is proposed based on a new reproducing kernel space. Using a transformation and modifying the traditional reproducing kernel method, the singular term is removed and the analytical representation of the exact solution is obtained in the form of series in the new reproducing kernel space. Compared with known investigations, its ...
متن کاملLWA 2006 Proceedings
In this work we propose a novel, generalized framework for feature space transformation in unsupervised knowledge discovery settings. Unsupervised feature space transformation inherently is a multi-objective optimization problem. In order to facilitate data exploration, transformations should increase the quality of the result and should still preserve as much of the original data set informati...
متن کاملدو روش تبدیل ویژگی مبتنی بر الگوریتم های ژنتیک برای کاهش خطای دسته بندی ماشین بردار پشتیبان
Discriminative methods are used for increasing pattern recognition and classification accuracy. These methods can be used as discriminant transformations applied to features or they can be used as discriminative learning algorithms for the classifiers. Usually, discriminative transformations criteria are different from the criteria of discriminant classifiers training or their error. In this ...
متن کاملAccuracy improvement of Best Scanline Search Algorithms for Object to Image Transformation of Linear Pushbroom Imagery
Unlike the frame type images, back-projection of ground points onto the 2D image space is not a straightforward process for the linear pushbroom imagery. In this type of images, best scanline search problem complicates image processing using Collinearity equation from computational point of view in order to achieve reliable exterior orientation parameters. In recent years, new best scanline sea...
متن کاملEvolutionary Feature Space Transformation Using Type-Restricted Generators
Data preprocessing, especially in terms of feature selection and generation, is an important issue in data mining and knowledge discovery tasks. Genetic algorithms proved to work well on feature selection problems where the search space produced by the initial feature set already contains the target hypothesis. In cases where this precondition is not fulfilled, one needs to construct new featur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006